Confirming configurations in EFSM
نویسندگان
چکیده
In this paper we investigate the problem of configuration distinguishability for the EFSM model, specifically, given a configuration and an arbitrary set of configurations, determine an input sequence such that the EFSM in the given configuration produces an output sequence different from that of the configurations in the given set or at least in a maximal proper subset. Such a sequence can be used in a test case to confirm the destination configuration. We demonstrate that the distinguishability problem could be reduced to the EFSM traversal problem, so that the existing methods and tools developed in the context of model checking become applicable. The theoretical framework for determining configuration-confirming sequences based on projections and products of EFSMs is presented. Our approach can be implemented in a number of heuristic test derivation strategies.
منابع مشابه
An Implementation of a QoE Evaluation Technique Including Business Model Parameters
The expansion of Internet-based services has increased the need to ensure a good quality on them. In this context, a preliminary work we developed exposes a Quality of Experience (QoE) evaluation framework based on the mathematical formalism of EFSMs, which includes business-related variables into the prediction analysis. In this paper, we present an implementation of this QoE evaluation framew...
متن کاملA characterization of the general protocol conformance testsequence generation problem for EFSM
We discuss the problems which arise in conformance testing when using the EFSM model as well as the problems which arise when extending the concepts used in FSM testing to EFSM. We characterize the problems of stability and executability of transitions, and see what these mean for generating test sequences. Also, we extend the concept of UIO sequences to EFSM, calling them identifying sequences...
متن کاملA characterization of the general protocol conformance testsequence generation problem for EFSM ' sRaymond
We discuss the problems which arise in conformance testing when using the EFSM model as well as the problems which arise when extending the concepts used in FSM testing to EFSM. We characterize the problems of stability and executability of transitions, and see what these mean for generating test sequences. Also, we extend the concept of UIO sequences to EFSM, calling them identifying sequences...
متن کاملExpanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in order to bypass the infeasible path problem. The approach is developed for the specification language SDL but, in order to aid generality, the rewriting process is broken down into two phases: producing a normal form EFS...
متن کاملEFSM-Based Test Case Generation: Sequence, Data, and Oracle
Model-based testing has been intensively and extensively studied in the past decades. Extended Finite State Machine (EFSM) is a widely used model of software testing in both academy and industry. This paper provides a survey on EFSM-based test case generation techniques in the last two decades. All techniques in EFSM-based test case generation are mainly classified into three parts: test sequen...
متن کامل